Unsupervised Learning for Parametric Optimization

نویسندگان

چکیده

This letter proposes the unsupervised training of a feedforward neural network to solve parametric optimization problems involving large numbers parameters. Such training, which consists in repeatedly sampling parameter values and performing stochastic gradient descent, foregoes taxing precomputation labeled data that supervised learning necessitates. As an example application, we put this technique use on rather general constrained quadratic program. Follow-up letters subsequently apply it more specialized wireless communication problems, some them nonconvex nature. In all cases, performance proposed procedure is very satisfactory and, terms computational cost, its scalability with problem dimensionality superior convex solvers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parametric Optimization Method for Machine Learning

The classiication problem of constructing a plane to separate the members of two sets can be formulated as a parametric bilinear program. This approach was originally created to minimize the number of points misclassiied. However, a novel interpretation of the algorithm is that the subproblems represent alternative error functions of the misclassiied points. Each subproblem identiies a speciied...

متن کامل

Unsupervised Feature Learning via Non-Parametric Instance Discrimination

Neural net classifiers trained on data with annotated class labels can also capture apparent visual similarity among categories without being directed to do so. We study whether this observation can be extended beyond the conventional domain of supervised learning: Can we learn a good feature representation that captures apparent similarity among instances, instead of classes, by merely asking ...

متن کامل

Parametric Learning and Monte Carlo Optimization

This paper uncovers and explores the close relationship between Monte Carlo Optimization of a parametrized integral (MCO), Parametric machine-Learning (PL), and ‘blackbox’ or ‘oracle’-based optimization (BO). We make four contributions. First, we prove that MCO is mathematically identical to a broad class of PL problems. This identity potentially provides a new application domain for all broadl...

متن کامل

Kernel Methods for Unsupervised Learning Kernel Methods for Unsupervised Learning Title: Kernel Methods for Unsupervised Learning

Kernel Methods are algorithms that projects input data by a nonlinear mapping in a new space (Feature Space). In this thesis we have investigated Kernel Methods for Unsupervised learning, namely Kernel Methods that do not require targeted data. Two classical unsupervised learning problems using Kernel Methods have been tackled. The former is the Data Dimensionality Estimation, the latter is the...

متن کامل

High-Dimensional Unsupervised Active Learning Method

In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2021

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2020.3027981